Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs
نویسندگان
چکیده
منابع مشابه
Recovering decimation-based cryptographic sequences by means of linear CAs
The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an...
متن کاملSynthesis of cryptographic interleaved sequences by means of linear cellular automata
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular...
متن کاملGeneration of Cryptographic Sequences by means of Difference Equations
In the present work, it is shown that the sequences obtained from cryptographic generators based on decimation are just particular solutions of a kind of linear difference equations. Moreover, all these sequences are simple linear combinations of a class of basic sequences (binomial sequences). Cryptographic parameters of decimated sequences, e.g. period, linear complexity or balancedness, can ...
متن کاملAffective Visual Stimuli: Characterization of the Picture Sequences Impacts by Means of Nonlinear Approaches
Introduction: The main objective of the present study was to investigate the effect of preceding pictorial stimulus on the emotional autonomic responses of the subsequent one. Methods: To this effect, physiological signals, including Electrocardiogram (ECG), Pulse Rate (PR), and Galvanic Skin Response (GSR) were collected. As these signals have random and chaotic nature, nonlinear dynamics...
متن کاملUsing Linear Difference Equations to Model Nonlinear Cryptographic Sequences
A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symmetric cryptography. The output sequences are written as solutions of linear difference equations, and three basic properties (period, linear complexity and number of different output sequences) are analyzed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2019
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzz051